منابع مشابه
Identification of functional information subgraphs in complex networks.
We present a general information theoretic approach for identifying functional subgraphs in complex networks. We show that the uncertainty in a variable can be written as a sum of information quantities, where each term is generated by successively conditioning mutual informations on new measured variables in a way analogous to a discrete differential calculus. The analogy to a Taylor series su...
متن کاملInhomogeneous evolution of subgraphs and cycles in complex networks.
Subgraphs and cycles are often used to characterize the local properties of complex networks. Here we show that the subgraph structure of real networks is highly time dependent: as the network grows, the density of some subgraphs remains unchanged, while the density of others increase at a rate that is determined by the network's degree distribution and clustering properties. This inhomogeneous...
متن کاملNonlinear Diffusion Through Large Complex Networks Containing Regular Subgraphs
Transport through generalized trees is considered. Trees contain the simple nodes and supernodes, either the well-structured regular subgraphs or those ample with triangles. We observe a superdiffusion for the highly connected nodes while it is Brownian (∝ t, d is the intrinsic space dimension of regular subgraphs) for the rest of nodes. Transport within a supernode is affected by the finite si...
متن کاملSubgraphs in random networks.
Understanding the subgraph distribution in random networks is important for modeling complex systems. In classic Erdos networks, which exhibit a Poissonian degree distribution, the number of appearances of a subgraph G with n nodes and g edges scales with network size as approximately N(n-g). However, many natural networks have a non-Poissonian degree distribution. Here we present approxima...
متن کاملConnection Subgraphs in Social Networks
A connection subgraph is a small (ie, viewable) subgraph of a social network that best captures the relationship between two people. We present a formal definition of this problem, and an ideal solution based on computation of current in electrical networks, or equivalently, based on random walks on weighted graphs. We then give a series of approximations to the ideal solution that produce high...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2008
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/41/38/385003